Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
نویسندگان
چکیده
This paper presents new results on an approach for solving satisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Reconfigurable Computing. We develop an algorithm that is suitable for a logic circuit implementation. This algorithm is basically equivalent to the Davis-Putnam procedure with Experimental Unit Propagation. The required hardware resources for the algorithm are less than those of MOM’s heuristics.
منابع مشابه
Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation
This paper presents new results on an innovative approach for solving satis ability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Recon gurable Computing, and has opened up an exciting new research eld in algorithm design. We have develope...
متن کاملSolving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware
This paper presents new results on an approach for solving satisfiability problems (SAT), i.e. creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach becomes feasible due to the recent advances in FPGAs and high-level logic synthesis. In this approach, each SAT problem is automatically analyzed and implemented on FPGA...
متن کاملExperimental Results on the Application of Satisfiability Algorithms to Scheduling Problems
Considerable progress has been made in recent years in understanding and solving propositional satisfiabilit y problems. Much of this work has been based on experiments on randomly generated 3SAT problems . One generally accepted shortcoming of this work is that it is not clear how the results and algorithms developed will carry over to “real” constraintsatisfaction problems. This paper reports...
متن کاملHeuristics Based on Unit Propagation for Satisfiability Problems
The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual "MaximumOccurrences in clauses of Minimum Size" heuristics. Based on the experimental evaluations of di erent alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics em...
متن کاملBounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming which combines local search and bounds propagation, inspired by the success of a randomized algorithm for Boolean Satisfiability (SAT) called Unit-Walk. A dynamic prioritization heuristic has been developed to improve the...
متن کامل